Euclidean and Geodesic Distance Profiles

نویسندگان

  • Ines Janusch
  • Nicole M. Artner
  • Walter G. Kropatsch
چکیده

This paper presents a boundary-based, topological shape descriptor: the distance profile. It is inspired by the LBP (= local binary pattern) scale space – a topological shape descriptor computed by a filtration with concentric circles around a reference point. For rigid objects, the distance profile is computed by the Euclidean distance of each boundary pixel to a reference point. A geodesic distance profile is proposed for articulated or deformable shapes: the distance is measured by a combination of the Euclidean distance of each boundary pixel to the nearest pixel of the shape’s medial axis and the geodesic distance along the shape’s medial axis to the reference point. In contrast to the LBP scale space, it is invariant to deformations and articulations and the persistence of the extrema in the profiles allows pruning of spurious branches (i.e. robustness against noise on the boundary). The distance profiles are applicable to any shape, but the geodesic distance profile is especially well-suited for articulated or deformable objects (e.g.applications in biology).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Assessment of the Log-Euclidean Metric Performance in Diffusion Tensor Image Segmentation

Introduction: Appropriate definition of the distance measure between diffusion tensors has a deep impact on Diffusion Tensor Image (DTI) segmentation results. The geodesic metric is the best distance measure since it yields high-quality segmentation results. However, the important problem with the geodesic metric is a high computational cost of the algorithms based on it. The main goal of this ...

متن کامل

Approximate geodesic distances reveal biologically relevant structures in microarray data

MOTIVATION Genome-wide gene expression measurements, as currently determined by the microarray technology, can be represented mathematically as points in a high-dimensional gene expression space. Genes interact with each other in regulatory networks, restricting the cellular gene expression profiles to a certain manifold, or surface, in gene expression space. To obtain knowledge about this mani...

متن کامل

بخش‌بندی معنادار مدل‌ سه‌بعدی اجسام بر اساس استخراج برجستگی‌ها و هسته جسم

3D model segmentation has an important role in 3D model processing programs such as retrieval, compression and watermarking. In this paper, a new 3D model segmentation algorithm is proposed. Cognitive science research introduces 3D object decomposition as a way of object analysis and detection with human. There are two general types of segments which are obtained from decomposition based on thi...

متن کامل

Euclidean & Geodesic Distance between a Facial Feature Points in Two-Dimensional Face Recognition System

In this paper, we present two feature extraction methods for two-dimensional face recognition. Our approaches are based on facial feature points detection then compute the Euclidean Distance between all pairs of this points for a first method (ED-FFP) and Geodesic Distance in the second approach (GD-FFP). These measures are employed as inputs to a commonly used classification techniques such as...

متن کامل

How to project 'circular' manifolds using geodesic distances?

Recent papers have clearly shown the advantage of using the geodesic distance instead of the Euclidean one in methods performing non-linear dimensionality reduction by means of distance preservation. This new metric greatly improves the performances of existing algorithms, especially when strongly crumpled manifolds have to be unfolded. Nevertheless, neither the Euclidean nor the geodesic dista...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017